Using Ant Colony Meta-heuristic Approach for Cellular Manufacturing System

نویسندگان

  • Shahram Saeedi
  • Iraj Mahdavi
چکیده

Grouping the machines and parts in a manufacturing system, based on similarities is known as cell formation problem. The problem is clustering items to form identified and specific groups having similar properties. Cellular Manufacturing System (CMS) can be defined as an application of Group Technology (GT) philosophy that allows decomposing a manufacturing system into subsystems to make it easier to manage than the entire manufacturing system. It has been shown that the grouping algorithm is NP-hard problem and the mathematical model is non-linear program. In fact, for real manufacturing systems with a large number of machines and parts, it may take a very long time to solve the problem using mathematical methods. That is why the heuristic approaches have attained the attention of many researchers and academicians. In this paper, we use Ant Colony Optimization (ACO) method as an evolutionary approach to solve the cell formation problems. This model uses a P = [Pij] (C)×(M+P) pheromone matrix in which, C, M, and P, are the number of cells, machines and parts respectively. The algorithm is programmed in the C language, and it is tested for some familiar examples mentioned in CMS literatures to show the applicability of the proposed model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic Approaches for Cell Formation in Cellular Manufacturing

Cellular Manufacturing System (CMS) is an application of Group Technology (GT) that allows decomposing a manufacturing system into subsystems. Grouping the machines and parts in a cellular manufacturing system, based on similarities is known as cell formation problem (CFP) which is an NP-hard problem. In this paper, a mathematical model is proposed for CFP and is solved using the Ant Colony Opt...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...

متن کامل

Meta-heuristics in cellular manufacturing: A state-of-the-art review

Article history: Received 1 April 2010 Received in revised form 22 July 2010 Accepted 30 July 2010 Available online 1 Auguest 2010 Meta-heuristic approaches are general algorithmic framework, often nature-inspired and designed to solve NP-complete optimization problems in cellular manufacturing systems and has been a growing research area for the past two decades. This paper discusses various m...

متن کامل

A Multi-agent System Architecture for Integrated Process Planning and Scheduling with Meta-heuristics

Manufacturing process planning and production scheduling functions are usually performed sequentially, disregarding the dynamic nature of manufacturing system. Integrated process planning and scheduling (IPPS) is to combine both the process planning and scheduling problems in the consideration, with the aim to improve the flexibility and adaptability of the actual process plan and the schedule ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008